Triangle-Free Planar Graphs and Segment Intersection Graphs
نویسندگان
چکیده
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a way that no two segments cross, i.e., intersect in a common
منابع مشابه
Planar Graphs as L-intersection or L-contact graphs
The x-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel x shapes in the plane. A subfamily of these graphs are {x, |,−}-contact graphs which are the contact graphs of axis parallel x, |, and − shapes in the plane. We prove here two results that were conjectured by Chaplick and Ueckerdt in 2013. We show that planar graphs are x-intersection gra...
متن کاملGeometric Intersection Graphs: Problems and Directions Collection of Open Problems 1. Coloring segment intersection graphs avoiding monochromatic cliques Proposer:
For a graph G and an integer k ≥ 2, let χk(G) denote the minimum number of colors in a coloring of the vertices of G such that no k-clique of G is monochromatic. In particular, χ2(G) is the ordinary chromatic number of G. It is known that triangle-free segment intersection graphs can have arbitrarily large chromatic number. It is also known that Kk-free string graphs can have arbitrarily large ...
متن کاملColoring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors
Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملOn-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algorithms, which became apparent after the recent construction of triangle-free geometric intersection graphs with arbitrarily large chromatic number due to Pawlik et al. We show that on-line graph coloring problems give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 6 شماره
صفحات -
تاریخ انتشار 1999